Dynamic graph cut based segmentation of mammogram
نویسندگان
چکیده
منابع مشابه
Dynamic graph cut based segmentation of mammogram
This work presents the dynamic graph cut based Otsu's method to segment the masses in mammogram images. Major concern that threatens human life is cancer. Breast cancer is the most common type of disease among women in India and abroad. Breast cancer increases the mortality rate in India especially in women since it is considered to be the second largest form of disease which leads to death. Ma...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولGraph cut based Automatic Prostate Segmentation
We propose a graph cut based automatic method for prostate segmentation using image features, context information and semantic knowledge. A volume of interest (VOI) is first identified using supervoxel oversegmentation and their subsequent classification. All voxels within the VOI are labeled prostate or background using graph cuts. Semantic information obtained from Random forest (RF) classifi...
متن کاملGraph Cut Segmentation Using
We present a graph cuts-based image segmentation technique that incorporates an elliptical shape prior. Inclusion of this shape constraint restricts the solution space of the segmentation result, increasing robustness to misleading information that results from noise, weak boundaries, and clutter. We argue that combining a shape prior with a graph cuts method suggests an iterative approach that...
متن کاملMultiregion Graph Cut Image Segmentation
The purpose of our study is two-fold: (1) investigate an image segmentation method which combines parametric modeling of the image data and graph cut combinatorial optimization and, (2) use a prior which allows the number of labels/regions to decrease when the number of regions is not known and the algorithm initialized with a larger number. Experimental verification shows that the method resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SpringerPlus
سال: 2015
ISSN: 2193-1801
DOI: 10.1186/s40064-015-1180-7